Module shifts and measure rigidity in linear cellular automata
نویسندگان
چکیده
منابع مشابه
Module Shifts and Measure Rigidity in Linear Cellular Automata
Suppose R is a finite commutative ring of prime characteristic, A is a finite Rmodule, M := Z×N , and Φ is an R-linear cellular automaton on A. If μ is a Φ-invariant measure which is multiply σ-mixing in a certain way, then we show that μ must be the Haar measure on a coset of some submodule shift of A. Under certain conditions, this means μ must be the uniform Bernoulli measure on A. Let A be ...
متن کاملMeasure rigidity for algebraic bipermutative cellular automata
Let (AZ, F ) be a bipermutative algebraic cellular automaton. We present conditions which force a probability measure which is invariant for the N×Z-action of F and the shift map σ to be the Haar measure on Σ, a closed shift-invariant subgroup of the Abelian compact group AZ. This generalizes simultaneously results of B. Host, A. Maass and S. Mart́ınez [7] and M. Pivato [14]. This result is appl...
متن کاملAsymptotic randomization of sofic shifts by linear cellular automata
Let M = Z be a D-dimensional lattice, and let (A,+) be an abelian group. AM is then a compact abelian group under componentwise addition. A continuous function : AM −→ AM is called a linear cellular automaton if there is a finite subset F ⊂ M and non-zero coefficients φf ∈ Z so that, for any a ∈ AM, (a) = ∑ f∈F φf · σ f(a). Suppose that μ is a probability measure onAM whose support is a subshif...
متن کاملCellular Automata vs. Quasisturmian Shifts
If L = Z and A is a finite set, then AL is a compact space; a cellular automaton (CA) is a continuous transformation Φ : AL−→AL that commutes with all shift maps. A quasisturmian (QS) subshift is a shift-invariant subset obtained by mapping the trajectories of an irrational torus rotation through a partition of the torus. The image of a QS shift under a CA is again QS. We study the topological ...
متن کاملLinear Cellular Automata and Finite Automata
Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiautomata, provide a natural setting for the study of cellular automata. For example, we give a simple algorithm to determine reversibility and surjectivity of the global maps. We also comment on Wolfram’s question about the growth rates of the minimal f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ergodic Theory and Dynamical Systems
سال: 2008
ISSN: 0143-3857,1469-4417
DOI: 10.1017/s0143385708000096